13th IEEE PowerTech Conference - PowerTech 2019, Milano (Italy). 23-27 June 2019
Summary:
Security and quality of supply continue to be major concern of power system operators. Thus, the expansion of transmission grids is certainly one of the major drivers to achieve this goal. In this scope, this paper presents a three-stage approach to solve the multi-year Transmission Expansion Planning (TEP) problem. This approach uses heuristic algorithms coupled with the Harmony Search (HS) metaheuristic and the Branch & Bound (B&B) algorithm. This hybrid method (HS-B&B) aims at finding the optimal multi-stage investment plan avoiding load shedding over the planning horizon. In this work, the AC-Optimal Power Flow (AC-OPF) is used to model the network as a way to consider the real operation conditions of the system. The method was validated using the Garver and the IEEE RTS 24 bus systems. Results demonstrate the reduction of computational effort without compromising the quality of the TEP.
Keywords: AC-Optimal Power Flow, Branch & Bound, Harmony Search, Heuristic Algorithm, Transmission Expansion Planning.
DOI: 
https://doi.org/10.1109/PTC.2019.8810478
Published in 2019 IEEE Milan PowerTech, pp: 1-6, ISBN: 978-1-5386-4723-3
Publication date: 2019-06-23.
Citation:
L.E. De Oliveira, J.P. Tomé Saraiva, P. Vilaça, F.D. Freitas, A three-stage multi-year transmission expansion planning using heuristic, metaheuristic and decomposition techniques, 13th IEEE PowerTech Conference - PowerTech 2019, Milano (Italy). 23-27 June 2019. In: 2019 IEEE Milan PowerTech: Conference proceedings, ISBN: 978-1-5386-4723-3
